Time-Optimal Trajectory Planning for the Manipulator Based on Improved Non-Dominated Sorting Genetic Algorithm II

نویسندگان

چکیده

To address the issues of low efficiency and lengthy running time associated with trajectory planning for 6-degree-of-freedom manipulators, this paper introduces a novel solution that generates time-optimal path manipulator while adhering to its kinematic limitations. The proposed method comprises several stages. Firstly, kinematics are analyzed. Secondly, manipulator’s joint-space points interpolated via quintic B-spline curve. Subsequently, non-dominated sorting genetic algorithm II (NSGA-II) is improved by applying reinforcement learning optimize crossover mutation probabilities, variable neighborhood search (VNS) integrated enhance local capability. Finally, joint increments optimized using NSGA-II, then determined simulation on MATLAB. Furthermore, compared other conventional optimization methods, approach has reduced total 19.26%, effectively improving working manipulator.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Distribution System Reconfiguration Using Non-dominated Sorting Genetic Algorithm (NSGA-II)

In this paper, a Non-dominated Sorting Genetic Algorithm-II (NSGA-II) based approach is presented for distribution system reconfiguration. In contrast to the conventional GA based methods, the proposed approach does not require weighting factors for conversion of multi-objective function into an equivalent single objective function. In order to illustrate the performance of the proposed method,...

متن کامل

A method for identifying software components based on Non-dominated Sorting Genetic Algorithm

Identifying the appropriate software components in the software design phase is a vital task in the field of software engineering and is considered as an important way to increase the software maintenance capability. Nowadays, many methods for identifying components such as graph partitioning and clustering are presented, but most of these methods are based on expert opinion and have poor accur...

متن کامل

Research on time optimal trajectory planning of 7-DOF manipulator based on genetic algorithm

Trajectory planning is the basis of robot control. A robot with seven degrees of freedom is the object of study. The shortest time is taken as the trajectory optimization target. The joint trajectory planning is carried out by using B-spline curve. Under the constraint of kinematics parameters, the time optimization of the motion trajectory is realized by using the improved genetic algorithm. T...

متن کامل

Non-dominated Sorting Genetic Algorithm-ii Based Route Optimization

NSGA methodology discussed in Section 3.1 suffers from three weaknesses: computational complexity, non-elitist approach and the need to specify a sharing parameter. An improved version of NSGA known as NSGA-II, which resolved the above problems and uses elitism to create a diverse Pareto-optimal front, has been subsequently presented (Deb et al 2002). The main features of NSGA-II are low comput...

متن کامل

Efficient Constellation Design Based on Improved Non-dominated Sorting Genetic Algorithm-II

Constellation design is a typical multiple peaks, multiple valleys and non-linear multi-objective optimization problem. How to design satellite constellation is one of the key sectors of research in the aerospace field. In this paper, in order to improve the global convergence and diversity performance of traditional constellation optimization algorithm, multi-parent arithmetic crossover and SB...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2023

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app13116757